Residual smoothing for complex symmetric systems
نویسنده
چکیده
We present a residual smoothing algorithm for the complex symmetric conjugate gradients method. As in the real case, the residual smoothing method reproduces the (quasi-minimising) QMR method, and is considerably simpler to compute.
منابع مشابه
Iterative Methods for the Solution of Very Large Complex Symmetric Linear Systems
In the eld of computational electrodynamics the discretization of Maxwell's equations using the Finite Integration Theory (FIT) yields very large, sparse, complex symmetric linear systems of equations. For this class of complex non-Hermitian systems a number of conjugate gradient-type algorithms is considered. The complex version of the biconjugate gradient (BiCG) method by Jacobs can be extend...
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملOn the reliability of complex systems with three dependent components per element
‎The complex system containing n elements‎, ‎each having three dependent components‎, ‎is described‎. ‎The reliability function of such systems is investigated using a trivariate binomial model‎. ‎In addition‎, ‎the mean residual life function of a complex system with intact components at time t is derived‎. ‎The results are simplified for a t...
متن کاملA Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
This paper extends the regularized smoothing Newton method in vector optimization to symmetric cone optimization, which provide a unified framework for dealing with the nonlinear complementarity problem, the second-order cone complementarity problem, and the semidefinite complementarity problem (SCCP). In particular, we study strong semismoothness and Jacobian nonsingularity of the total natura...
متن کاملA new CPA resistant software implementation for symmetric ciphers with smoothed power consumption: SIMON case study
In this paper we propose a new method for applying hiding countermeasure against CPA attacks. This method is for software implementation, based on smoothing power consumption of the device. This method is evaluated on the SIMON scheme as a case study; however, it is not relying on any specific SIMON features. Our new method includes only AND equivalent and XOR equivalent operations since every ...
متن کامل